Left Termination of the query pattern less_in_2(a, g) w.r.t. the given Prolog program could successfully be proven:



↳ Prolog
  ↳ PrologToPiTRSProof

Clauses:

less(0, s(X)).
less(s(X), s(Y)) :- less(X, Y).

Queries:

less(a,g).

We use the technique of [30].Transforming Prolog into the following Term Rewriting System:
Pi-finite rewrite system:
The TRS R consists of the following rules:

less_in(s(X), s(Y)) → U1(X, Y, less_in(X, Y))
less_in(0, s(X)) → less_out(0, s(X))
U1(X, Y, less_out(X, Y)) → less_out(s(X), s(Y))

The argument filtering Pi contains the following mapping:
less_in(x1, x2)  =  less_in(x2)
s(x1)  =  s(x1)
U1(x1, x2, x3)  =  U1(x3)
0  =  0
less_out(x1, x2)  =  less_out(x1)

Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog



↳ Prolog
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof

Pi-finite rewrite system:
The TRS R consists of the following rules:

less_in(s(X), s(Y)) → U1(X, Y, less_in(X, Y))
less_in(0, s(X)) → less_out(0, s(X))
U1(X, Y, less_out(X, Y)) → less_out(s(X), s(Y))

The argument filtering Pi contains the following mapping:
less_in(x1, x2)  =  less_in(x2)
s(x1)  =  s(x1)
U1(x1, x2, x3)  =  U1(x3)
0  =  0
less_out(x1, x2)  =  less_out(x1)


Using Dependency Pairs [1,30] we result in the following initial DP problem:
Pi DP problem:
The TRS P consists of the following rules:

LESS_IN(s(X), s(Y)) → U11(X, Y, less_in(X, Y))
LESS_IN(s(X), s(Y)) → LESS_IN(X, Y)

The TRS R consists of the following rules:

less_in(s(X), s(Y)) → U1(X, Y, less_in(X, Y))
less_in(0, s(X)) → less_out(0, s(X))
U1(X, Y, less_out(X, Y)) → less_out(s(X), s(Y))

The argument filtering Pi contains the following mapping:
less_in(x1, x2)  =  less_in(x2)
s(x1)  =  s(x1)
U1(x1, x2, x3)  =  U1(x3)
0  =  0
less_out(x1, x2)  =  less_out(x1)
LESS_IN(x1, x2)  =  LESS_IN(x2)
U11(x1, x2, x3)  =  U11(x3)

We have to consider all (P,R,Pi)-chains

↳ Prolog
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof
        ↳ PiDP
          ↳ DependencyGraphProof

Pi DP problem:
The TRS P consists of the following rules:

LESS_IN(s(X), s(Y)) → U11(X, Y, less_in(X, Y))
LESS_IN(s(X), s(Y)) → LESS_IN(X, Y)

The TRS R consists of the following rules:

less_in(s(X), s(Y)) → U1(X, Y, less_in(X, Y))
less_in(0, s(X)) → less_out(0, s(X))
U1(X, Y, less_out(X, Y)) → less_out(s(X), s(Y))

The argument filtering Pi contains the following mapping:
less_in(x1, x2)  =  less_in(x2)
s(x1)  =  s(x1)
U1(x1, x2, x3)  =  U1(x3)
0  =  0
less_out(x1, x2)  =  less_out(x1)
LESS_IN(x1, x2)  =  LESS_IN(x2)
U11(x1, x2, x3)  =  U11(x3)

We have to consider all (P,R,Pi)-chains
The approximation of the Dependency Graph [30] contains 1 SCC with 1 less node.

↳ Prolog
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof
        ↳ PiDP
          ↳ DependencyGraphProof
            ↳ PiDP
              ↳ UsableRulesProof

Pi DP problem:
The TRS P consists of the following rules:

LESS_IN(s(X), s(Y)) → LESS_IN(X, Y)

The TRS R consists of the following rules:

less_in(s(X), s(Y)) → U1(X, Y, less_in(X, Y))
less_in(0, s(X)) → less_out(0, s(X))
U1(X, Y, less_out(X, Y)) → less_out(s(X), s(Y))

The argument filtering Pi contains the following mapping:
less_in(x1, x2)  =  less_in(x2)
s(x1)  =  s(x1)
U1(x1, x2, x3)  =  U1(x3)
0  =  0
less_out(x1, x2)  =  less_out(x1)
LESS_IN(x1, x2)  =  LESS_IN(x2)

We have to consider all (P,R,Pi)-chains
For (infinitary) constructor rewriting [30] we can delete all non-usable rules from R.

↳ Prolog
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof
        ↳ PiDP
          ↳ DependencyGraphProof
            ↳ PiDP
              ↳ UsableRulesProof
                ↳ PiDP
                  ↳ PiDPToQDPProof

Pi DP problem:
The TRS P consists of the following rules:

LESS_IN(s(X), s(Y)) → LESS_IN(X, Y)

R is empty.
The argument filtering Pi contains the following mapping:
s(x1)  =  s(x1)
LESS_IN(x1, x2)  =  LESS_IN(x2)

We have to consider all (P,R,Pi)-chains
Transforming (infinitary) constructor rewriting Pi-DP problem [30] into ordinary QDP problem [15] by application of Pi.

↳ Prolog
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof
        ↳ PiDP
          ↳ DependencyGraphProof
            ↳ PiDP
              ↳ UsableRulesProof
                ↳ PiDP
                  ↳ PiDPToQDPProof
                    ↳ QDP
                      ↳ QDPSizeChangeProof

Q DP problem:
The TRS P consists of the following rules:

LESS_IN(s(Y)) → LESS_IN(Y)

R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs: